Performance Evaluation of Cache-aligned 4-ary AM-heap
نویسنده
چکیده
AM-heap is a heap data structure with O(1) amortized insertion time and O(logn) deletion time complexities. This paper presents cache-aligned 4-ary AM-heap in which every node has four children except that the root has three children. In this heap, the leftmost node of each sibling has an index of a multiple of four. Also, every node index matches its corresponding array index and every sibling nodes smoothly fits into a single cache block. Our experimental results show that cache-aligned 4-ary AM-heap is faster than AM-heap as well as post-order heap.
منابع مشابه
Experimental Study of High Performance Priority Queues
The priority queue is a very important and widely used data structure in computer science, with a variety of applications including Dijkstra’s Single Source Shortest Path algorithm on sparse graph types. This study presents the experimental results of a variety of priority queues. The focus of the experiments is to measure the speed and performance of highly specialized priority queues in out-o...
متن کاملPriority Queues and Dijkstra ’ s Algorithm ∗
We study the impact of using different priority queues in the performance of Dijkstra’s SSSP algorithm. We consider only general priority queues that can handle any type of keys (integer, floating point, etc.); the only exception is that we use as a benchmark the DIMACS Challenge SSSP code [1] which can handle only integer values for distances. Our experiments were focussed on the following: 1....
متن کاملMeasuring and Improving the Performance of Cache-efficient Priority Queues in Dijkstra’s Algorithm
The priority queue is an useful data structure in computation. There currently exist many implementations of this data structure, including some that are cache-aware and some cache-oblivious. In this study, we compare the performance of several implementations of priority queues in Dijkstra’s Single Source Shortest Path algorithm. We compare high performance heaps, such as the 4ary Aligned Heap...
متن کاملChopping Up Trees to Improve Spatial Locality in Implicit k-Heaps
Research on the performance of implicit k-heaps has shown that aligning data with cache lines and increasing heap arity are effective techniques for improving the data reference locality of heap operations. The technique of tree blocking has long been used to enhance the data reference locality of tree-based search methods. In this paper we propose c-clustered tree blocking, a new tree blocking...
متن کاملExperimental evaluation of local heaps
In this paper we present a cache-aware realization of a priority queue, named a local heap, which is a slight modification of a standard binary heap. The new data structure is cache efficient, has a small computational overhead, and achieves a good worst-case performance with respect to the number of element comparisons and the number of element moves. We show both theoretically and experimenta...
متن کامل